Certificates of infeasibility via nonsmooth optimization

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Certificates of infeasibility via nonsmooth optimization

An important aspect in the solution process of constraint satisfaction problems is to identify exclusion boxes which are boxes that do not contain feasible points. This paper presents a certificate of infeasibility for finding such boxes by solving a linearly constrained nonsmooth optimization problem. Furthermore, the constructed certificate can be used to enlarge an exclusion box by solving a...

متن کامل

Control via Nonsmooth Optimization ∗

We present a new approach to mixed H 2 /H∞ output feedback control synthesis. Our method uses nonsmooth mathematical programming techniques to compute locally optimal H 2 /H∞-controllers, which may have a predefined structure. We prove global convergence of our method and present tests to validate it numerically. 1. Introduction. Mixed H 2 /H ∞ output feedback control is a prominent example of ...

متن کامل

Nonsmooth Optimization via Bfgs

We investigate the BFGS algorithm with an inexact line search when applied to nonsmooth functions, not necessarily convex. We define a suitable line search and show that it generates a sequence of nested intervals containing points satisfying the Armijo and weak Wolfe conditions, assuming only absolute continuity. We also prove that the line search terminates for all semi-algebraic functions. T...

متن کامل

Certificates of linear mixed integer infeasibility

A central result in the theory of integer optimization states that a system of linear diophantine equations Ax = b has no integral solution if and only if there exists a vector in the dual lattice, yT A integral such that yT b is fractional. We extend this result to systems that both have equations and inequalities {Ax = b, Cx ≤ d}. We show that a certificate of integral infeasibility is a line...

متن کامل

Infeasibility Certificates for linear matrix inequalities

Farkas’ lemma is a fundamental result from linear programming providing linear certificates for infeasibility of systems of linear inequalities. In semidefinite programming, such linear certificates only exist for strongly infeasible linear matrix inequalities. We provide nonlinear algebraic certificates for all infeasible linear matrix inequalities in the spirit of real algebraic geometry. Mor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Global Optimization

سال: 2016

ISSN: 0925-5001,1573-2916

DOI: 10.1007/s10898-016-0473-x